Two Lagrangian Relaxation Based Heuristics for Vertex Coloring Problem
نویسندگان
چکیده
منابع مشابه
Lagrangian Relaxation Method for the Step fixed-charge Transportation Problem
In this paper, a step fixed charge transportation problem is developed where the products are sent from the sources to the destinations in existence of both unit and step fixed-charges. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost (sum of unit and step fixed-charges) to satisfy the demand of each customer. As the problem i...
متن کاملTwo Stage Facility Location Problem: Lagrangian Based Heuristics
In the two-stage capacitated facility location problem a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost ...
متن کاملHeuristics Based on Lagrangian Relaxation for the Vehicle Routing Problem with Time Windows
In this paper, two different heuristics for the vehicle routing problem with time windows (VRPTW) are presented: the Sequential Insertion Heuristic and the Cluster and Sequential Insertion Heuristic. Both are based on the Lagrangian relaxation of the constraints which require each customer to be serviced exactly once. They were evaluated based on the classical six test problem sets described in...
متن کاملLagrangian Based Heuristics for the Linear Ordering Problem
Assume that the elements of a finite set N are to be ordered and that some associated precedence costs, {cij : i, j ∈ N, i = j}, are given. For any ordering of the elements of N and any pair of elements i, j ∈ N , whenever i is placed prior to j, one incurs a cost cij . Otherwise, a cost cji is incurred. The Linear Ordering Problem (LOP) is to find an ordering of the elements of N where the tot...
متن کاملPolynomial Cases for the Vertex Coloring Problem
The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of four of these problems: for (P5, dart)-free graphs, (P5, banner)-free graphs, (P5, bull)-free graphs, and (fork, bull)-free graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cumhuriyet Science Journal
سال: 2020
ISSN: 2587-2680
DOI: 10.17776/csj.628518